Combining Lipschitz and RBF surrogate models for high-dimensional computationally expensive problems

نویسندگان

چکیده

Standard evolutionary optimization algorithms assume that the evaluation of objective and constraint functions is straightforward computationally cheap. However, in many real-world problems, these evaluations involve expensive numerical simulations or physical experiments. Surrogate-assisted (SAEAs) have recently gained increased attention for their performance solving types problems. The main idea SAEAs integration an algorithm with a selected surrogate model approximates function. In this paper, we propose based on Lipschitz underestimation use it to develop differential evolution-based algorithm. algorithm, called Differential Evolution (LSADE), utilizes Lipschitz-based model, along standard radial basis function local search procedure. experimental results seven benchmark dimensions 30, 50, 100, 200 show proposed LSADE competitive compared state-of-the-art under limited computational budget, being especially effective very complicated high dimensions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling

We present a parallel evolutionary optimization algorithm that leverages surrogate models for solving computationally expensive design problems with general constraints, on a limited computational budget. The essential backbone of our framework is an evolutionary algorithm coupled with a feasible sequential quadratic programming solver in the spirit of Lamarckian learning.We employ a trust-regi...

متن کامل

Combining multiple surrogate models to accelerate failure probability estimation with expensive high-fidelity models

In failure probability estimation, importance sampling constructs a biasing distribution that targets the failure event such that a small number of model evaluations is sufficient to achieve a Monte Carlo estimate of the failure probability with an acceptable accuracy; however, the construction of the biasing distribution often requires a large number of model evaluations, which can become comp...

متن کامل

SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems

This paper presents a parallel surrogate-based global optimization method for computationally expensive objective functions that is more effective for larger numbers of processors. To reach this goal, we integrated concepts from multi-objective optimization and tabu search into, single objective, surrogate optimization. Our proposed derivative-free algorithm, called SOP, uses non-dominated sort...

متن کامل

A multi-fidelity surrogate-model-assisted evolutionary algorithm for computationally expensive optimization problems

Integrating data-driven surrogate models and simulation models of di erent accuracies (or delities) in a single algorithm to address computationally expensive global optimization problems has recently attracted considerable attention. However, handling discrepancies between simulation models with multiple delities in global optimization is a major challenge. To address it, the two major contrib...

متن کامل

Memetic algorithm using multi-surrogates for computationally expensive optimization problems

In this paper, we present a Multi-Surrogates Assisted Memetic Algorithm (MSAMA) for solving optimization problems with computationally expensive fitness functions. The essential backbone of our framework is an evolutionary algorithm coupled with a local search solver that employs multi-surrogates in the spirit of Lamarckian learning. Inspired by the notion of 'blessing and curse of uncertainty'...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2023

ISSN: ['0020-0255', '1872-6291']

DOI: https://doi.org/10.1016/j.ins.2022.11.045